翻訳と辞書 Words near each other ・ Baumschlager-Eberle ・ Baumschulenweg ・ Baumschulenweg station ・ Baumschulenweg–Neukölln link line ・ Baumslag group ・ Baumslag–Solitar group ・ Baumstam ・ Baumstein ・ Baumstown, Pennsylvania ・ Baumwall (Hamburg U-Bahn station) ・ Baumwollspinnerei Ermen & Engels ・ Baumwollspinnerei Hammerstein ・ Baumé Restaurant ・ Baumé scale ・ Baum–Connes conjecture ・ Baum–Sweet sequence ・ Baum–Welch algorithm ・ Bauna ・ Baunach ・ Baunach (river) ・ Baunach Young Pikes ・ Baunatal ・ Baunatal (Madrid Metro) ・ Bauneg Beg Mountain ・ Baunei ・ BauNetz ・ Baungon, Bukidnon ・ Baunilha e chocolate ・ Baunilhas River ・ Baunogenasraid Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Baum–Sweet sequence ： ウィキペディア英語版 Baum–Sweet sequence In mathematics the Baum–Sweet sequence is an infinite automatic sequence of 0s and 1s defined by the rule: :''b''''n'' = 1 if the binary representation of ''n'' contains no block of consecutive 0s of odd length; :''b''''n'' = 0 otherwise; for ''n'' ≥ 0. For example, ''b''4 = 1 because the binary representation of 4 is 100, which only contains one block of consecutive 0s of length 2; whereas ''b''5 = 0 because the binary representation of 5 is 101, which contains a block of consecutive 0s of length 1. Starting at ''n'' = 0, the first few terms of the Baum–Sweet sequence are: :1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1 ... The properties of the sequence were first studied by L.E. Baum and M.M. Sweet in 1976.〔Baum, L. E. and Sweet, M. M. ''Continued Fractions of Algebraic Power Series in Characteristic 2'' Ann. Math. 103, 593-610, 1976.〕 ==Properties== The Baum–Sweet sequence can be generated by a three state automaton.〔(Finite automata and arithmetic ), Jean-Paul Allouche〕 The value of term ''b''''n'' in the Baum–Sweet sequence can be found recursively as follows. If ''n'' = ''m''·4''k'', where ''m'' is not divisible by 4, then :$b\_n\; =$ \begin 0 & \text m \text \\ b_ & \text m \text. \end Thus b76 = ''b''9 = ''b''4 = ''b''0 = 1, which can be verified by observing that the binary representation of 76, which is 1001100, contains no consecutive blocks of 0s with odd length. The Baum–Sweet word 1101100101001001..., which is created by concatenating the terms of the Baum–Sweet sequence, is a fixed point of the morphism or string substitution rules :00 → 0000 :01 → 1001 :10 → 0100 :11 → 1101 as follows: :11 → 1101 → 11011001 → 1101100101001001 → 11011001010010011001000001001001 ... From the morphism rules it can be seen that the Baum–Sweet word contains blocks of consecutive 0s of any length (''b''''n'' = 0 for all 2''k'' integers in the range 5.2''k'' ≤ ''n'' < 6.2''k''), but it contains no block of three consecutive 1s. The Baum–Sweet sequence is the sequence of coefficients of the unique solution of the cubic equation ''f'' 3 + ''Xf'' + 1 = 0 in the field F2((''X'' −1)) of formal Laurent series over F2.〔Graham Everest ''Recurrence Sequences'' AMS 2003, p 236〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Baum–Sweet sequence」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.